Efficient distance transformation for path-based metrics
نویسندگان
چکیده
منابع مشابه
Distance Metrics and Data Transformation
2 Distance metrics and similarity measures 2 2.1 Distance metrics . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 2.2 Vector norm and metric . . . . . . . . . . . . . . . . . . . . . . . 3 2.3 The `p norm and `p metric . . . . . . . . . . . . . . . . . . . . . 3 2.4 Distance metric learning . . . . . . . . . . . . . . . . . . . . . . . 6 2.5 The mean as a similarity measure . . . . . . ...
متن کامل2D Subquadratic Separable Distance Transformation for Path-Based Norms
In many applications, separable algorithms have demonstrated their efficiency to perform high performance and parallel volumetric computations, such as distance transformation or medial axis extraction. In the literature, several authors have discussed about conditions on the metric to be considered in a separable approach. In this article, we present generic separable algorithms to efficiently...
متن کاملSpace-efficient path-reporting approximate distance oracles
We consider approximate path-reporting distance oracles, distance labeling and labeled routing with extremely low space requirement, for general undirected graphs. For distance oracles, we show how to break the n log n space bound of Thorup and Zwick if approximate paths rather than distances need to be reported. For approximate distance labeling and labeled routing, we break the previously bes...
متن کاملPath-Based Distance for Street Map Comparison
Comparing two geometric graphs embedded in space is important in the field of transportation network analysis. Given street maps of the same city collected from different sources, researchers often need to know how and where they differ. However, the majority of current graph comparison algorithms are based on structural properties of graphs, such as their degree distribution or their local con...
متن کاملPath-Based Reuse Distance Analysis
Profiling can effectively analyze program behavior and provide critical information for feedback-directed or dynamic optimizations. Based on memory profiling, reuse distance analysis has shown much promise in predicting data locality for a program using inputs other than the profiled ones. Both wholeprogram and instruction-based locality can be accurately predicted by reuse distance analysis. R...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Vision and Image Understanding
سال: 2020
ISSN: 1077-3142
DOI: 10.1016/j.cviu.2020.102925